Search techniques, Fibonacci lengths and centro-polyhedral groups
نویسنده
چکیده
For a finitely generated group G = 〈A〉 where A = {a1, a2, . . . , an} the sequence xi = ai+1, 0 ≤ i ≤ n − 1, xi+n = ∏n j=1 xi+j−1, i ≥ 0, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic, we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). We examine the Fibonacci lengths of all generating pairs for certain centro-polyhedral groups. The problem requires a variety of approaches both exhaustive and random search. 2000 Mathematics Subject Classification: 20F05.
منابع مشابه
Search techniques and epimorphisms between certain groups and Fibonacci groups (TITLE CHANGED TO ALMOST YOUR SUGGESTION BUT INCLUDES ‘SEARCH TECHNIQUES’)
We examine the Fibonacci lengths of all generating pairs for certain centro-polyhedral groups. The problem requires a variety of approaches both exhaustive and random search. 1991 Mathematics Subject Classification: 20F05.
متن کاملCOMPUTATIONAL RESULTS ON FINITE P-GROUPS OF EXPONENT P2
The Fibonacci lengths of the finite p-groups have been studied by R. Dikici and co-authors since 1992. All of the considered groups are of exponent p, and the lengths depend on the celebrated Wall number k(p). The study of p-groups of nilpotency class 3 and exponent p has been done in 2004 by R. Dikici as well. In this paper we study all of the p-groups of nilpotency class 3 and exponent p2. Th...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملA Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملFibonacci Index and Stability Number of Graphs: a Polyhedral Study
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a conne...
متن کامل